Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas
نویسندگان
چکیده
منابع مشابه
Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas
Given a Boolean formula and a satisfying assignment, a flip is an operation that changes the value of a variable in the assignment so that the resulting assignment remains satisfying. We study the problem of computing the shortest sequence of flips (if one exists) that transforms a given satisfying assignment s to another satisfying assignment t of a Boolean formula. Earlier work characterized ...
متن کاملSolution-Graphs of Boolean Formulas and Isomorphism
The solution graph of a Boolean formula on n variables is the subgraph of the hypercube Hn induced by the satisfying assignments of the formula. The structure of solution graphs has been the object of much research in recent years since it is important for the performance of SAT-solving procedures based on local search. Several authors have studied connectivity problems in such graphs focusing ...
متن کاملShortest paths between shortest paths
We study the following problem on recon guring shortest paths in graphs: Given two shortest st paths, what is the minimum number of steps required to transform one into the other, where each intermediate path must also be a shortest s-t path and must di er from the previous one by only one vertex. We prove that the shortest recon guration sequence can be exponential in the size of the graph and...
متن کاملOn the Structure of Solution-Graphs for Boolean Formulas
In this work we extend the study of solution graphs and prove that for boolean formulas in a class called CPSS, all connected components are partial cubes of small dimension, a statement which was proved only for some cases in [16]. In contrast, we show that general Schaefer formulas are powerful enough to encode graphs of exponential isometric dimension and graphs which are not even partial cu...
متن کاملWitnesses for Boolean Matrix Multiplication and for Shortest Paths
The subcubic (O(n) for ω < 3) algorithms to multiply Boolean matrices do not provide the witnesses; namely, they compute C = AB but if Cij = 1 they do not find an index k (a witness) such that Aik = Bkj = 1. We design a deterministic algorithm for computing the matrix of witnesses that runs in Õ(n) time, where here Õ(n) denotes O(n(log n)). The subcubic methods to compute the shortest distances...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2017
ISSN: 0895-4801,1095-7146
DOI: 10.1137/16m1065288